Evolving Graphs by Graph Programming
نویسندگان
چکیده
Rule-based graph programming is a deep and rich topic. We present an approach to exploiting the power of graph programming as a representation and as an execution medium in an evolutionary algorithm (EGGP). We demonstrate this power in comparison with Cartesian Genetic Programming (CGP), showing that it is significantly more efficient in terms of fitness evaluations on some classic benchmark problems. We hypothesise that this is due to its ability to exploit the full graph structure, leading to a richer mutation set, and outline future work to test this hypothesis, and to exploit further the power of graph programming within an EA.
منابع مشابه
An Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...
متن کاملEvolving Graph Representation and Visualization
The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner of evolution of such networks. By adding a dimension of time to graph analysis, evolving graphs present opportunities and challenges to extract valuable information. This paper introduces the Evolving Graph Markup Lang...
متن کاملClustering-based Scalable Evolving Graphs for Vehicular Ad Hoc Networks
Message routing in vehicular ad hoc networks (VANETs) pose a particular technical challenge due to their highly dynamic nature. Eiza and Ni [1] have proposed an evolving graph approach to route messages in VANETs both reliably and efficiently. Evolving graphs, however, are resource intensive and do not scale well as the density of vehicles in the network increases. In this paper, we present a h...
متن کاملTowards Publish/Subscribe Functionality on Graphs
In this work, we introduce the publish/subscribe paradigm to support continuous query processing over evolving graphs and motivate it for a number of applications and a variety of possible continuous queries. To the best of our knowledge, this is the first work in the literature that considers supporting publish/subscribe in graphs; we focus specifically on massive and dynamically evolving grap...
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملTime-Evolving Graph Processing on Commodity Clusters
Graph-structured data is on the rise, in size, complexity and dynamism [1]. This growth has spurred the development of a large number of graph processing systems [5, 6, 8, 10– 12, 14, 16–18, 21, 24–27, 29] in both academia and opensource community. By leveraging specialized abstractions and careful optimizations, these systems have the ability to analyze large, static graphs, some in the order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018